Optimal Feasible Green Light Assignment to a Traffic Intersection using Intersection Graph
نویسندگان
چکیده
A feasible green light assignment is an assignment of time period to each traffic stream so that only compatible traffic streams are allowed to recieve overlapping time period. In case of an intersection, it is almost always possible to find several feasible green light assignments. We usually have some goal such as to minimise the total waiting time, to maximise the volume of flow etc. , to be achieved. In this paper we will try to find an optimal feasible green light assignment which minimises the waiting time at the same time maximises the volume of flow, using intersection graph.
منابع مشابه
An Optimal Dynamic Control Method for an Isolated Intersection Using Fuzzy Systems
Traffic flow systems are nonlinear and uncertain, so it is very difficult to find their optimal points. In traditional traffic control systems, the traffic lights of crossings change in a fixed time period that is not optimal. On the other hand, most proposed systems are sufficiently capable of coping with the uncertainties of traffic flow. To solve this problem, there is a need to develop expe...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملDeveloping an Analytical Model and Simulation of The Contraflow Left-Turn Lane at Signalized Intersections
At some intersections, excessive queue lengths may spill out of the left-turn bay and block the through lanes, jeopardizing level of service for the entire intersection. One of the most effective plans recently presented by the researchers is the "Contraflow left-turn lane" (CLL) In this method, left-turn vehicles will use the nearest lane in the opposite direction in addition to the usual left...
متن کاملSOME RESULTS ON THE COMPLEMENT OF THE INTERSECTION GRAPH OF SUBGROUPS OF A FINITE GROUP
Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...
متن کاملHelp the Genetic Algorithm to Minimize the Urban Traffic on Intersections
The Goal of this project is to obtain the optimal cycle traffic lights at the intersection. To find time for each cycle of the traffic lights are red, yellow and green is the average number of waiting cars at behind of a red light. Traffic Modeling with Petri nets in CPN TOOLS software simulations has been conducted. Data collection was performed at various times as the objectively reasonable s...
متن کامل